Mr. C. W. Hobley, C. M. G

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

T C C C Beatcs No 109 S C: W M P G S?

The design of efficient algorithms for planar graphs, as a field of research, is over forty year old and continues to be an exciting area. There are several new efficient algorithms for a variety of graph optimization problems that exploit planarity and, in general, the structure of low genus graphs and graphs with excluded minors. Efficient space-bounded computations, on the other hand, involv...

متن کامل

Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation & material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological...

متن کامل

Vaccination .B. C. G

This article was presented by the author at the Vaccination Seminar of May 26, 1972, National University Medical School.

متن کامل

Continuity of the M/G/c queue

Consider an M/G/c queue with homogeneous servers and service time distribution F . It is shown that an approximation of the service time distribution F by stochastically smaller distributions, say Fn, leads to an approximation of the stationary distribution π of the original M/G/c queue by the stationary distributions πn of the M/G/c queues with service time distributions Fn. Here all approxima...

متن کامل

Perfect Simulation of $M/G/c$ Queues

In this paper we describe a perfect simulation algorithm for the stableM/G/c queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209–213) showed how to build a dominated CFTP algorithm for perfect simulation of the super-stable M/G/c queue operating under First Come First Served discipline, with dominating process pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1947

ISSN: 0028-0836,1476-4687

DOI: 10.1038/159768b0